Guessing models and generalized Laver diamond

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Guessing models and generalized Laver diamond

We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from supercompactness to rank-to-rank embeddings. The majority of these large cardinals properties can be defined in terms of suitable elementary embeddings j : ...

متن کامل

On Generalized Diamond Spanners

Given a set P of points in the plane and a set L of non-crossing line segments whose endpoints are in P , a constrained plane geometric graph is a plane graph whose vertex set is P and whose edge set contains L. An edge e has the α-visible diamond property if one of the two isosceles triangles with base e and base angle α does not contain any points of P visible to both endpoints of e. A constr...

متن کامل

Improved Models for Password Guessing

One approach to measuring password strength is to assess the probability it will be cracked in a fixed set of guesses. The current state of the art in password guessing employs a first-order Markov model that makes several assumptions about the distribution of passwords. We present two novel approaches to modeling password distributions that remove some of these assumptions. First, a layered Ma...

متن کامل

Guessing Clubs in the Generalized Club Filter

We present principles for guessing clubs in the generalized club filter on Pκλ. These principles are shown to be weaker than classical diamond principles but often serve as sufficient substitutes. One application is a new construction of a λ-Suslin-tree using assumptions different from previous constructions. The other application partly solves open problems regarding the cofinality of reflecti...

متن کامل

Club Guessing and the Universal Models

We survey the use of club guessing and other pcf constructs in the context of showing that a given partially ordered class of objects does not have a largest, or a universal element. 1

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2012

ISSN: 0168-0072

DOI: 10.1016/j.apal.2011.12.015